Clustering Using Student t Mixture Copulas

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

High-quality vertex clustering for surface mesh segmentation using Student-t mixture model

In order to robustly perform segmentation for industrial design objects measured by a 3-D scanning device, we propose a new method for high-quality vertex clustering on a noisy mesh. Using Student-t mixture model with the variational Bayes approximation, we develop a vertex clustering algorithm in the 9-D space composed of three kinds of principal curvaturemeasures alongwith vertex position and...

متن کامل

Dependency Clustering of Mixed Data with Gaussian Mixture Copulas

Heterogeneous data with complex feature dependencies is common in real-world applications. Clustering algorithms for mixed – continuous and discrete valued – features often do not adequately model dependencies and are limited to modeling meta–Gaussian distributions. Copulas, that provide a modular parameterization of joint distributions, can model a variety of dependencies but their use with di...

متن کامل

Model-based clustering using copulas with applications

Copyright and reuse: The Warwick Research Archive Portal (WRAP) makes this work by researchers of the University of Warwick available open access under the following conditions. Copyright © and all moral rights to the version of the paper presented here belong to the individual author(s) and/or other copyright owners. To the extent reasonable and practicable the material made available in WRAP ...

متن کامل

Adaptive Mixture of Student-t Distributions: The R Package AdMit

This introduction to the R package AdMit is a shorter version of Ardia et al. (2009), published in the Journal of Statistical Software. The package provides flexible functions to approximate a certain target distribution and to efficiently generate a sample of random draws from it, given only a kernel of the target density function. The core algorithm consists of the function AdMit which fits a...

متن کامل

Deep Unsupervised Clustering Using Mixture of Autoencoders

Unsupervised clustering is one of the most fundamental challenges in machine learning. A popular hypothesis is that data are generated from a union of low-dimensional nonlinear manifolds; thus an approach to clustering is identifying and separating these manifolds. In this paper, we present a novel approach to solve this problem by using a mixture of autoencoders. Our model consists of two part...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SN Computer Science

سال: 2021

ISSN: 2662-995X,2661-8907

DOI: 10.1007/s42979-021-00503-0